- run-time constant
- константа времени выполнения
English-Russian dictionary of computer science. 2015.
run-time constant
Смотреть что такое "run-time constant" в других словарях:
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Constant interface — In the Java programming language, the constant interface pattern describes the use of an interface solely to define constants, and having classes implement that interface in order to achieve convenient syntactic access to those constants. However … Wikipedia
Constant time — In computational complexity theory, constant time, or O(1) time, refers to the computation time of a problem when the time needed to solve that problem does not depend on the size of the data it is given as input.For example, accessing any single … Wikipedia
Run length limited — or RLL coding is a technique that is used to store data on recordable media. Specifically, RLL prevents long stretches of repeated bits from causing the signal recorded on media to not change for an excessive period, by modulating the data. RLL… … Wikipedia
Time in physics — In physics, the treatment of time is a central issue. It has been treated as a question of geometry. One can measure time and treat it as a geometrical dimension, such as length, and perform mathematical operations on it. It is a scalar quantity… … Wikipedia
Time travel — This article details time travel itself. For other uses, see Time Traveler. Time travel is the concept of moving between different moments in time in a manner analogous to moving between different points in space, either sending objects (or in… … Wikipedia
Time dilation — This article is about a concept in physics. For the concept in sociology, see time displacement. In the theory of relativity, time dilation is an observed difference of elapsed time between two events as measured by observers either moving… … Wikipedia
run — v. & n. v. (running; past ran; past part. run) 1 intr. go with quick steps on alternate feet, never having both or all feet on the ground at the same time. 2 intr. flee, abscond. 3 intr. go or travel hurriedly, briefly, etc. 4 intr. a advance by… … Useful english dictionary
time complexity — noun the amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms Classical computers cannot sort a list of size in less than time … Wiktionary
Time preference — In economics, time preference (or discounting ) pertains to how large a premium a consumer will place on enjoyment nearer in time over more remote enjoyment.There is no absolute distinction that separates high and low time preference, only… … Wikipedia
Polynomial time — In computational complexity theory, polynomial time refers to the computation time of a problem where the run time, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically using big O notation, this states … Wikipedia
